Convex optimization of programmable quantum computers

Programmable Antenna Design using Convex Optimization

This work presents an application of convex optimization and algebraic geometry in devising secure, powerefficient, beam-steerable, and on-chip transmission systems for wireless networks. First, we introduce a passively controllable smart (PCS) antenna system that can be programmed to generate different radiation patterns in far field by adjusting its variable passive controller at every signal...

Entropy, Convex Optimization, and Competitive Quantum Interactions

A refereed game can be modelled as an exchange of messages between two competing players and a referee, after which the referee chooses a winner. In a quantum refereed game the players and referee may perform quantum computations and exchange quantum messages. In this paper we examine the problem of deciding, given a fixed referee, which of the two players has a winning strategy. We give a dete...

Robust quantum error correction via convex optimization.

We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory num...

Quantum error correction via convex optimization

We show that the problem of designing a quantum information processing error correcting procedure can be cast as a bi-convex optimization problem, iterating between encoding and recovery, each being a semidefinite program. For a given encoding operator the problem is convex in the recovery operator. For a given method of recovery, the problem is convex in the encoding scheme. This allows us to ...

Programmable Automation : the Future of Computers